A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm
نویسندگان
چکیده
منابع مشابه
An Explicit Quasi-Newton Update for Sparse Optimization Calculations
A new quasi-Newton updating formula for sparse optimization calculations is presented. It makes combined use of a simple strategy for fixing symmetry and a Schubert correction to the upper triangle of a permuted Hessian approximation. Interesting properties of this new update are that it is closed form and that it does not satisfy the secant condition at every iteration of the calculations. Som...
متن کاملQuasi-Newton updates with weighted secant equations
We provide a formula for variational quasi-Newton updates with multiple weighted secant equations. The derivation of the formula leads to a Sylvester equation in the correction matrix. Examples are given.
متن کاملSparse Portfolio Selection via Quasi-Norm Regularization
to obtain an approximate second-order KKT solution of the `p-norm models in polynomial time with a fixed error tolerance, and then test our `p-norm models on CRSP(1992-2013) and also S&P 500 (2008-2012) data. The empirical results illustrate that our `p-norm regularized models can generate portfolios of any desired sparsity with portfolio variance, portfolio return and Sharpe Ratio comparable t...
متن کاملPartial-Update L∞-Norm Adaptive Filtering Algorithm with Sparse Updates
This paper provides a partial-update normalized sign least-mean square (NSLMS) algorithm with sparse updates. The proposed algorithm reduces the computational complexity compared with the conventional L∞-norm adaptive filtering algorithms by decreasing the frequency of updating the filter coefficients and updating only a part of the filter coefficients. And we develop a mean square analysis to ...
متن کاملTitle Subspace segmentation with a minimal square frobenius norm
We introduce a novel subspace segmentation method called Minimal Squared Frobenius Norm Representation (MSFNR). MSFNR performs data clustering by solving a convex optimization problem. We theoretically prove that in the noiseless case, MSFNR is equivalent to the classical Factorization approach and always classifies data correctly. In the noisy case, we show that on both synthetic and real-word...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1981
ISSN: 0025-5718
DOI: 10.2307/2007437